Adaptive joint H.263-channel coding for memoryless binary channels
نویسندگان
چکیده
The main purpose of this paper is to show that once the video source coding is dependent on the channel characteristics, better performance can be achieved in terms of reconstructed video quality. Our study considers a fixed overall bit rate transmission of 64 kbit/s over error prone memoryless binary channels and the source coder is the ITU-T H.263 video standard. The variable H.263 source coding rate adapts to a particular channel Bit Error Rate (BER) at any instant of time. Firstly, we investigated the error sensitivities of H.263 syntactical elements and grouped them into several classes of different significance. By identifying the most sensitive elements, we developed a data grouping (DG) technique which by itself, exhibits improved error resilience. Secondly, we design an Unequal Error Protection (UEP) scheme and compare its performance with an equivalent (same source coding bit rate) Equal Error Protection (EEP) scheme, using Rate Compatible Punctured Convolutional (RCPC) codes of different rates for forward error protection. Both forward error correction schemes adopted have resulted in PSNR improvements over 20 dB for BERs higher than of 4x10. Finally, if during the real time encoding process, the encoder is aware of the channel BER and there is an unlimited number of code rates, this paper shows that UEP and EEP strategies provide quite similar performances.
منابع مشابه
On the Joint Source-Channel Coding Error Exponent for Discrete Memoryless Systems: Computation and Comparison with Separate Coding
We investigate the computation of Csiszár’s bounds for the joint source-channel coding (JSCC) error exponent, EJ , of a communication system consisting of a discrete memoryless source and a discrete memoryless channel. We provide equivalent expressions for these bounds and derive explicit formulas for the rates where the bounds are attained. These equivalent representations can be readily compu...
متن کاملQuantization of memoryless and Gauss-Markov sources over binary Markov channels
Joint source–channel coding for stationary memoryless and Gauss–Markov sources and binary Markov channels is considered. The channel is an additive-noise channel where the noise process is an M th-order Markov chain. Two joint source-channel coding schemes are considered. The first is a channel-optimized vector quantizer—optimized for both source and channel. The second scheme consists of a sca...
متن کاملGaussian Z Channel with Intersymbol Interference
In this paper, we derive a capacity inner bound for a synchronous Gaussian Z channel with intersymbol interference (ISI) under input power constraints. This is done by converting the original channel model into an n-block memoryless circular Gaussian Z channel (n-CGZC) and successively decomposing the n-block memoryless channel into a series of independent parallel channels in the frequency dom...
متن کاملCross-Layer Design for Video Transmission over Wireless Rician Slow-Fading Channels Using an Adaptive Multiresolution Modulation and Coding Scheme
We describe a multilayered video transport scheme for wireless channels capable of adapting to channel conditions in order to maximize end-to-end quality of service (QoS). This scheme combines a scalable H.263+ video source coder with unequal error protection (UEP) across layers. The UEP is achieved by employing different channel codes together with amultiresolutionmodulation approach to transp...
متن کاملBounds for Multiple-Access Relay Channels with Feedback via Two-way Relay Channel
In this study, we introduce a new two-way relay channel and obtain an inner bound and an outer bound for the discrete and memoryless multiple access relay channels with receiver-source feedback via two-way relay channel in which end nodes exchange signals by a relay node. And we extend these results to the Gaussian case. By numerical computing, we show that our inner bound is the same with o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002